A Partition-Based Match Making Algorithm for Dynamic Ridesharing
نویسندگان
چکیده
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملDynamic Optimization Models for Ridesharing and Carsharing
Collaborative consumption is the culture of sharing instead of ownership in consumer behaviours. Transportation services such as ridesharing, carsharing, and bikesharing have recently adopted collaborative business models. Such services require real-time management of the available fleets to increase revenues and reduce costs. This thesis proposes two dynamic models for real-time management of ...
متن کاملDynamic Data Partition Algorithm for a Parallel H.264 Encoder
The H.264/AVC standard is a highly efficient video codec providing high-quality videos at low bit-rates. As employing advanced techniques, the computational complexity has been increased. The complexity brings about the major problem in the implementation of a real-time encoder and decoder. Parallelism is the one of approaches which can be implemented by multi-core system. We analyze macroblock...
متن کاملDynamic Matching for Real-Time Ridesharing
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملA Best-Match Algorithm for Broad-Coverage Example-Based Disambiguation
To improve tit(.' coverage of examl)le-bases , two nlethods are introduced into the 1)est-match algor i thm. The first is for acquiring conjunctive relat ionships fl'om corpora, as measures of word similarity t h a t can be used in addit ion to thesauruses. The Second, used when a word does not appear in an examltled)asc or a thesaurus, is for inferring links to words in the examph>base by ( 'm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Intelligent Transportation Systems
سال: 2015
ISSN: 1524-9050,1558-0016
DOI: 10.1109/tits.2015.2413453